Convex Hull

Wang Zi Qiang et al presented a new algorithm for computing the convex hull of a planar point set in 1998, and claimed that the worst case time complexity of the algorithm is O ( n), which can lead to a linear time algorithm for sorting.

王志强等于1998年提出了一个计算平面点集凸包的新算法，并且声称该算法的最坏时间复杂度为O（n），从而为线性时间排序提供了可能性。

Presents an algorithm for determining the convex hull of a finite set of points in a plane. The algorithm requires O ( n) multi-plications and O ( nlogn) comparisons.

提出了一种求平面有限点集凸壳顶点的算法，并分析出该算法的时间复杂性是线性次乘法和O（nlogn）次两个数的比较。

plane development method of convex hull plate based on parametric surface representation

基于参数曲面表达的帆形船体外板展开方法

Being a basic structure of computational geometry, convex hull is important to data analysis of GIS.

凸壳作为计算几何的一种基本的结构,对GIS的数据分析有着重要作用.

As far as we know, this was the first time convex hull was introduced to data streams.

据我们所知，这是第一次把凸包算法应用到数据流的突变检测上来。

At the same time it has the local controllability inherited from convex hull.

同时,它天然继承凸壳的局部性特点.

They are as follow, an optimal algorithm for determining the convex hull of a finite planar point set, an algorithm for triangulation of planar point-set in O ( nlogn) time, the fast algorithm for Delaunay triangulation of simple polygon based on maximum triangle weights.

它们分别是求平面点集凸壳的格雷厄姆方法的一个改进算法，一种时间复杂度为O（nlogn）的平面点集三角剖分算法和简单多边形快速Delaunay三角剖分算法。

In this paper, the closed convex hull, extreme points and support points of the class of Robertson functions are determined by linear homeomorphism.

本文借助线性同胚关系，确定了罗勃生（Robertson）函数族的闭凸包、极端点和支撑点。

an algorithm for finding a convex hull of the vertices of a polygonal line

寻求多边形链顶点凸壳的算法

It rotates the point set and calculates the extremum of X ( Y) coordinate, and finally gets the Convex Hull of the point set.

该算法采用点集不断旋转并求X（Y）坐标极值的方法得到平面点集的近似凸壳。

The machine can also make convex hull on paper which is especially suitable for the heavy duty air filter.

此机可根据客户要求还能在纸上打凸包，特别适合生产特种大空滤。

constructing convex hull of planar point set is a basic algorithm in computational geometry.

求平面点集的凸包是计算几何的一个基本算法。

3-D Endocardial Surface Modelling Based on the Convex Hull Algorithm

基于凸包算法的三维心内膜模型的构建

parallel convex hull algorithm of planar point set based on pc cluster

平面点集凸包的并行算法研究

That is multi-direction extreme value approximate convex hull algorithm, and is called MDEV for short.

提出并实现了平面点集凸壳的一种新的近似算法 —— 多方向极值法.

An algorithm for finding the convex hull of a simple polygon using active double line testing

简单多边形凸包的双动线检测算法

maximal margin linear classifier based on the contraction of the closed convex hull

基于闭凸包收缩的最大边缘线性分类器

In practice, ROC Convex Hull ( ROCCH ) method which combines techniques from computational geometry is used.

在实际应用中, 基于样本数据集,通过计算几何的方式得到ROC凸包曲线 ( ROCCH ) .

we achieved a new parallel algorithm of 3d convex hull generation on ati stream.

在ATI Stream平台上实现了三维模型凸包生成算法。

the engineer used a mesh convex hull for the 3d model.

工程师为这个三维模型使用了网格凸包。

Relying on the theorem of Graham, the sample points are realized the minimal convex hull which computational complexity is O ( NlogN).

根据凸包生成算法原理，用Graham算法实现散乱样本的最小凸包，算法复杂度为O（NlogN）。

approximate algorithm for convex hull of planar point set

平面点集凸壳的一种近似算法

An improved image recognition and registration algorithm based on convex hull and affine invariant was presented.

提出了一种新的基于凸壳和仿射不变量的图像识别和配准的方法.

an algorithm for determining convex hull of a given planar point set

一种给定平面点集凸壳算法

A Research for Selecting Baseline Point of the Territorial Sea Based on Technique of the Convex Hull Construction

基于凸壳构造技术的领海基点选取问题研究

an efficient algorithm for computing the convex hull of plane point set is proposed.

提出一种计算平面点集凸壳的快速算法。

Classic convex hull algorithm. JAVA language. Absolutely correct.

经典的凸包算法. JAVA语言编写. 绝对正确.

two dimensional convex hull is one of the typical problems in computational geometry and widely applied in gis.

二维凸包问题是计算几何领域的经典问题之一，在地理信息系统中有广泛的应用。

optimum algorithm for constructing convex hull of planar point set utilizing plus or minus characteristic of demarcation

利用正负划分性求平面点集凸包的最优算法

an efficient algorithm for the convex hull of planar point set

平面点集凸壳的一种快速算法